Comparing f β -Optimal with Distance Based Merge Functions
نویسندگان
چکیده
Merge functions informally combine information from a certain universe into a solution over that same universe. This typically results in a, preferably optimal, summarization. In previous research, merge functions over sets have been looked into extensively. A specific case concerns sets that allow elements to appear more than once, multisets. In this paper we compare two types of merge functions over multisets against each other. We examine both general properties as practical usability in a real world application.
منابع مشابه
A Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach
In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...
متن کاملNew spatial clustering-based models for optimal urban facility location considering geographical obstacles
The problems of facility location and the allocation of demand points to facilities are crucial research issues in spatial data analysis and urban planning. It is very important for an organization or governments to best locate its resources and facilities and efficiently manage resources to ensure that all demand points are covered and all the needs are met. Most of the recent studies, which f...
متن کاملInterleaving Distance between Merge Trees
Merge trees are topological descriptors of scalar functions. They record how the subsets of the domain where the function value does not exceed a given threshold are connected. We define a distance between merge trees, called an interleaving distance, and prove the stability of these trees, with respect to this distance, to perturbations of the functions that define them. We show that the inter...
متن کاملOptimal information for approximating periodic analytic functions
Let Sβ := {z ∈ C : | Im z| < β} be a strip in the complex plane. For fixed integer r ≥ 0 let Hr ∞,β denote the class of 2π-periodic functions f , which are analytic in Sβ and satisfy |f(r)(z)| ≤ 1 in Sβ . Denote by Hr,R ∞,β the subset of functions from Hr ∞,β that are real-valued on the real axis. Given a function f ∈ Hr ∞,β , we try to recover f(ζ) at a fixed point ζ ∈ R by an algorithm A on t...
متن کاملA Novel Approach for Word Spotting Using Merge-Split Edit Distance
Edit distance matching has been used in literature for word spotting with characters taken as primitives. The recognition rate however, is limited by the segmentation inconsistencies of characters (broken or merged) caused by noisy images or distorted characters. In this paper, we have proposed a Mergesplit edit distance which overcomes these segmentation problems by incorporating a multi-purpo...
متن کامل